DFS is Unsparsable and Lookahead Can Help in Maximal Matching
نویسندگان
چکیده
منابع مشابه
How much can lookahead help in online single machine scheduling
This paper studies online single machine scheduling where jobs have unit length and the objective is to maximize the number of completed jobs. Lookahead is considered to improve the competitiveness of online deterministic strategies. For preemption-restart model, we will prove a lower bound of ( LD + 2)/( LD + 1) for the case where LD 1 and 3/2 for the case where 0 LD < 1, in which LD is the le...
متن کاملString matching with lookahead
Forward-SBNDM is a recently introduced variation of the BNDM algorithm for exact string matching. Forward-SBNDM inspects a 2-gram in the text such that the first character is the last one of an alignment window of the pattern and the second one is then outside the window. We present a generalization of this idea by inspecting several lookahead characters beyond an alignment window and integrate...
متن کاملMatching Needs and Resources: How NLP Can Help Theoretical Linguistics
While some linguistic questions pose challenges that could be met by developing and applying NLP techniques, other problems can best be approached with a blend of old-fashioned linguistic investigation and the use of simple, well-established NLP tools. Unfortunately, this means that the NLP component is too simple to be of interest to the computationally-minded, while existing tools are often d...
متن کاملMaximal matching scheduling is good enough
In high-speed switches the Input Queued(IQ) architecture is very popular due to its low memory-bandwidth requirement compared to the Output Queued (OQ) switch architecture which is extremely desirable in terms of performance but requires very high memory-bandwidth. In the past decade researchers and industry people have been trying hard to £nd good scheduling algorithm for IQ switches. The two ...
متن کاملKeyframe Retrieval by Keypoints: Can Point-to-Point Matching Help?
Bag-of-words representation with visual keypoints has recently emerged as an attractive approach for video search. In this paper, we study the degree of improvement when point-to-point (P2P) constraint is imposed on the bag-of-words. We conduct investigation on two tasks: near-duplicate keyframe (NDK) retrieval, and high-level concept classification, covering parts of TRECVID 2003 and 2005 data...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Cybernetica
سال: 2018
ISSN: 0324-721X
DOI: 10.14232/actacyb.23.3.2018.10